This paper addresses an Electric Vehicle Relocation Problem (E-VReP), inone-way carsharing systems, based on operators who move through foldingbicycles between a delivery request and one of pickup. In order to deal withits economical sustainability, a revenue associated with each relocationrequest satisfied and a cost due to each operator used are introduced. The newoptimization objective maximizes the total profit. To overcome the drawback dueto the high CPU time required by the Mixed Integer Linear Programmingformulation of the E-VReP, four heuristics, also based on general properties ofthe feasible solutions, are designed. Their effectiveness is tested on two setsof realistic instances. In the first one, all the requests have the samerevenue. In the second one, the revenue of each request has a variablecomponent related to the user's rent-time and a fixed one related to thecustomer satisfaction. Finally, a sensitivity analysis is carried out on boththe number of requests and the fixed revenue component.
展开▼
